-
1 unlabeled graph
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > unlabeled graph
-
2 unlabeled graph
Большой англо-русский и русско-английский словарь > unlabeled graph
-
3 unlabeled graph
Математика: непомеченный граф -
4 unlabeled graph
мат. -
5 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
6 labeled graph
помеченный граф, нагруженный графграф, вершинам или рёбрам которого присвоены значения (пометки).Syn:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > labeled graph
-
7 непомеченный граф
Большой англо-русский и русско-английский словарь > непомеченный граф
-
8 node
1) узела) соединение методом завязывания или его результат; затянутая петляб) утолщение; вздутие; нарост; выступг) особая точка кривой, точка кривой с несколькими касательнымим) контактный вывод (напр. на печатной плате)2) вчт гипертекстовый документ3) вчт категориальная часть лингвистической пометы•- access feeder node
- accessible from A-node
- adjacent node
- ancestor node
- ascending node
- base node
- bottom node
- brother nodes
- child node
- clock node
- connected nodes
- current node
- datum node
- daughter node
- descendant node
- descending node
- drain node
- electric node
- end node
- even node
- external node
- father node
- final node
- graph node
- hypertext node
- incident to edge node
- initial node
- integrated branch node
- internal node
- isolated node
- labeled node
- leaf node
- magnetic node
- major node
- network node
- north node
- odd node
- packet switch node
- packet switching node
- parent node
- partial node
- radio node
- reference node
- sibling nodes
- sink node
- sinoatrial node
- source node
- south node
- stable node
- star node
- star-shaped node
- switching node
- terminal node
- tip node
- tree node
- unlabeled node
- unstable node
- user node
- voltage node
- wave node
- wavefront node
- whole node
- winning node -
9 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
10 node
1) узела) соединение методом завязывания или его результат; затянутая петляб) утолщение; вздутие; нарост; выступг) особая точка кривой, точка кривой с несколькими касательнымим) контактный вывод (напр. на печатной плате)р) бион. скопление клеток или тканей одного типа в другой среде2) вчт. гипертекстовый документ3) вчт. категориальная часть лингвистической пометы•- accessible from A node
- adjacent node
- ancestor node
- ascending node
- base node
- bottom node
- brother nodes
- child node
- clock node
- connected nodes
- current node
- datum node
- daughter node
- descendant node
- descending node
- drain node
- electric node
- end node
- even node
- external node
- father node
- final node
- graph node
- hypertext node
- incident to edge node
- initial node
- integrated branch node
- internal node
- isolated node
- labeled node
- leaf node
- magnetic node
- major node
- network node
- node of Ranvier
- north node
- odd node
- packet switch node
- packet switching node
- parent node
- partial node
- radio node
- reference node
- sibling nodes
- sink node
- sinoatrial node
- source node
- south node
- stable node
- star node
- star-shaped node
- switching node
- terminal node
- tip node
- tree node
- unlabeled node
- unstable node
- user node
- voltage node
- wave node
- wavefront node
- whole node
- winning nodeThe New English-Russian Dictionary of Radio-electronics > node
-
11 node
См. также в других словарях:
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… … Wikipedia
Split graph — In graph theory, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs were first studied by Földes and Hammer in two papers in 1977, and independently introduced by Tyshkevich and… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Coxeter–Dynkin diagram — See also: Dynkin diagram Coxeter Dynkin diagrams for the fundamental finite Coxeter groups … Wikipedia
Word-sense disambiguation — Disambiguation redirects here. For other uses, see Disambiguation (disambiguation). In computational linguistics, word sense disambiguation (WSD) is an open problem of natural language processing, which governs the process of identifying which… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Polytree — A simple polytree In graph theory, a polytree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph (DAG) for which there are no undirected cycles either.… … Wikipedia